387 research outputs found
Distance statistics in large toroidal maps
We compute a number of distance-dependent universal scaling functions
characterizing the distance statistics of large maps of genus one. In
particular, we obtain explicitly the probability distribution for the length of
the shortest non-contractible loop passing via a random point in the map, and
that for the distance between two random points. Our results are derived in the
context of bipartite toroidal quadrangulations, using their coding by
well-labeled 1-trees, which are maps of genus one with a single face and
appropriate integer vertex labels. Within this framework, the distributions
above are simply obtained as scaling limits of appropriate generating functions
for well-labeled 1-trees, all expressible in terms of a small number of basic
scaling functions for well-labeled plane trees.Comment: 24 pages, 9 figures, minor corrections, new added reference
Distance statistics in quadrangulations with a boundary, or with a self-avoiding loop
We consider quadrangulations with a boundary and derive explicit expressions
for the generating functions of these maps with either a marked vertex at a
prescribed distance from the boundary, or two boundary vertices at a prescribed
mutual distance in the map. For large maps, this yields explicit formulas for
the bulk-boundary and boundary-boundary correlators in the various encountered
scaling regimes: a small boundary, a dense boundary and a critical boundary
regime. The critical boundary regime is characterized by a one-parameter family
of scaling functions interpolating between the Brownian map and the Brownian
Continuum Random Tree. We discuss the cases of both generic and self-avoiding
boundaries, which are shown to share the same universal scaling limit. We
finally address the question of the bulk-loop distance statistics in the
context of planar quadrangulations equipped with a self-avoiding loop. Here
again, a new family of scaling functions describing critical loops is
discovered.Comment: 55 pages, 14 figures, final version with minor correction
Combinatorics of bicubic maps with hard particles
We present a purely combinatorial solution of the problem of enumerating
planar bicubic maps with hard particles. This is done by use of a bijection
with a particular class of blossom trees with particles, obtained by an
appropriate cutting of the maps. Although these trees have no simple local
characterization, we prove that their enumeration may be performed upon
introducing a larger class of "admissible" trees with possibly doubly-occupied
edges and summing them with appropriate signed weights. The proof relies on an
extension of the cutting procedure allowing for the presence on the maps of
special non-sectile edges. The admissible trees are characterized by simple
local rules, allowing eventually for an exact enumeration of planar bicubic
maps with hard particles. We also discuss generalizations for maps with
particles subject to more general exclusion rules and show how to re-derive the
enumeration of quartic maps with Ising spins in the present framework of
admissible trees. We finally comment on a possible interpretation in terms of
branching processes.Comment: 41 pages, 19 figures, tex, lanlmac, hyperbasics, epsf. Introduction
and discussion/conclusion extended, minor corrections, references adde
Partition Function Zeros of a Restricted Potts Model on Lattice Strips and Effects of Boundary Conditions
We calculate the partition function of the -state Potts model
exactly for strips of the square and triangular lattices of various widths
and arbitrarily great lengths , with a variety of boundary
conditions, and with and restricted to satisfy conditions corresponding
to the ferromagnetic phase transition on the associated two-dimensional
lattices. From these calculations, in the limit , we determine
the continuous accumulation loci of the partition function zeros in
the and planes. Strips of the honeycomb lattice are also considered. We
discuss some general features of these loci.Comment: 12 pages, 12 figure
Statistics of geodesics in large quadrangulations
We study the statistical properties of geodesics, i.e. paths of minimal
length, in large random planar quadrangulations. We extend Schaeffer's
well-labeled tree bijection to the case of quadrangulations with a marked
geodesic, leading to the notion of "spine trees", amenable to a direct
enumeration. We obtain the generating functions for quadrangulations with a
marked geodesic of fixed length, as well as with a set of "confluent
geodesics", i.e. a collection of non-intersecting minimal paths connecting two
given points. In the limit of quadrangulations with a large area n, we find in
particular an average number 3*2^i of geodesics between two fixed points at
distance i>>1 from each other. We show that, for generic endpoints, two
confluent geodesics remain close to each other and have an extensive number of
contacts. This property fails for a few "exceptional" endpoints which can be
linked by truly distinct geodesics. Results are presented both in the case of
finite length i and in the scaling limit i ~ n^(1/4). In particular, we give
the scaling distribution of the exceptional points.Comment: 37 pages, 18 color figures, improved version with several
clarifications (mostly in sections 2.1 and 2.4) and one added section (3.1)
on ensembles of random quadrangulation
On the digraph of a unitary matrix
Given a matrix M of size n, a digraph D on n vertices is said to be the
digraph of M, when M_{ij} is different from 0 if and only if (v_{i},v_{j}) is
an arc of D. We give a necessary condition, called strong quadrangularity, for
a digraph to be the digraph of a unitary matrix. With the use of such a
condition, we show that a line digraph, LD, is the digraph of a unitary matrix
if and only if D is Eulerian. It follows that, if D is strongly connected and
LD is the digraph of a unitary matrix then LD is Hamiltonian. We conclude with
some elementary observations. Among the motivations of this paper are coined
quantum random walks, and, more generally, discrete quantum evolution on
digraphs.Comment: 6 page
Symmetry groupoids and patterns of synchrony in coupled cell networks
A coupled cell system is a network of dynamical systems, or “cells,” coupled together. Such systems
can be represented schematically by a directed graph whose nodes correspond to cells and whose
edges represent couplings. A symmetry of a coupled cell system is a permutation of the cells that
preserves all internal dynamics and all couplings. Symmetry can lead to patterns of synchronized
cells, rotating waves, multirhythms, and synchronized chaos. We ask whether symmetry is the only
mechanism that can create such states in a coupled cell system and show that it is not.
The key idea is to replace the symmetry group by the symmetry groupoid, which encodes information
about the input sets of cells. (The input set of a cell consists of that cell and all cells
connected to that cell.) The admissible vector fields for a given graph—the dynamical systems with
the corresponding internal dynamics and couplings—are precisely those that are equivariant under
the symmetry groupoid. A pattern of synchrony is “robust” if it arises for all admissible vector
fields. The first main result shows that robust patterns of synchrony (invariance of “polydiagonal”
subspaces under all admissible vector fields) are equivalent to the combinatorial condition that an
equivalence relation on cells is “balanced.” The second main result shows that admissible vector
fields restricted to polydiagonal subspaces are themselves admissible vector fields for a new coupled
cell network, the “quotient network.” The existence of quotient networks has surprising implications
for synchronous dynamics in coupled cell systems
Uniform infinite planar triangulation and related time-reversed critical branching process
We establish a connection between the uniform infinite planar triangulation
and some critical time-reversed branching process. This allows to find a
scaling limit for the principal boundary component of a ball of radius R for
large R (i.e. for a boundary component separating the ball from infinity). We
show also that outside of R-ball a contour exists that has length linear in R.Comment: 27 pages, 5 figures, LaTe
Unicyclic Components in Random Graphs
The distribution of unicyclic components in a random graph is obtained
analytically. The number of unicyclic components of a given size approaches a
self-similar form in the vicinity of the gelation transition. At the gelation
point, this distribution decays algebraically, U_k ~ 1/(4k) for k>>1. As a
result, the total number of unicyclic components grows logarithmically with the
system size.Comment: 4 pages, 2 figure
Entangled networks, synchronization, and optimal network topology
A new family of graphs, {\it entangled networks}, with optimal properties in
many respects, is introduced. By definition, their topology is such that
optimizes synchronizability for many dynamical processes. These networks are
shown to have an extremely homogeneous structure: degree, node-distance,
betweenness, and loop distributions are all very narrow. Also, they are
characterized by a very interwoven (entangled) structure with short average
distances, large loops, and no well-defined community-structure. This family of
nets exhibits an excellent performance with respect to other flow properties
such as robustness against errors and attacks, minimal first-passage time of
random walks, efficient communication, etc. These remarkable features convert
entangled networks in a useful concept, optimal or almost-optimal in many
senses, and with plenty of potential applications computer science or
neuroscience.Comment: Slightly modified version, as accepted in Phys. Rev. Let
- …